High-Level Algorithm Prototyping: An Example Extending the TVR-DART Algorithm

نویسندگان

  • Axel Ringh
  • Xiaodong Zhuge
  • Willem Jan Palenstijn
  • Kees Joost Batenburg
  • Ozan Öktem
چکیده

Operator Discretization Library (ODL) is an open-source Python library for prototyping reconstruction methods for inverse problems, and ASTRA is a high-performance Matlab/Python toolbox for large-scale tomographic reconstruction. The paper demonstrates the feasibility of combining ODL with ASTRA to prototype complex reconstruction methods for discrete tomography. As a case in point, we consider the total-variation regularized discrete algebraic reconstruction technique (TVR-DART). TVR-DART assumes that the object to be imaged consists of a limited number of distinct materials. The ODL/ASTRA implementation of this algorithm makes use of standardized building blocks, that can be combined in a plug-and-play manner. Thus, this implementation of TVR-DART can easily be adapted to account for application specific aspects, such as various noise statistics that come with different imaging modalities.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Extending the Radar Dynamic Range using Adaptive Pulse Compression

The matched filter in the radar receiver is only adapted to the transmitted signal version and its output will be wasted due to non-matching with the received signal from the environment. The sidelobes amplitude of the matched filter output in pulse compression radars are dependent on the transmitted coded waveforms that extended as much as the length of the code on both sides of the target loc...

متن کامل

A Capacitated Vehicle Routing Problem considering Satisfaction Level of Customers: A Genetic Algorithm

Capacitated vehicle routing problem (CVRP) is one of the most well-known and applicable issues in the field of transportation. It has been proved to be an NP-Complete problem. To this end, it is needed to develop a high-performance algorithm to solve the problem, particularly in large scales. This paper develops a novel mathematical model for the CVRP considering the satisfaction level of deman...

متن کامل

A numerical algorithm for solving a class of matrix equations

In this paper, we present a numerical algorithm for solving matrix equations $(A otimes B)X = F$  by extending the well-known Gaussian elimination for $Ax = b$. The proposed algorithm has a high computational efficiency. Two numerical examples are provided to show the effectiveness of the proposed algorithm.

متن کامل

Case-Based Synthesis of Telecommunication Architectures

As the design of systems has become more complex, promoting rapid prototyping has emerged to be an effective solution to meet the increasing time-to-market demands. Reducing the design time and cost of an electronic system are two main objectives of rapid prototyping. This paper describes a novel design flow for rapid prototyping of telecommunication systems, particularly in the application are...

متن کامل

Extending Two-Dimensional Bin Packing Problem: Consideration of Priority for Items

In this paper a two-dimensional non-oriented guillotine bin packing problem is studied when items have different priorities. Our objective is to maximize the total profit which is total revenues minus costs of used bins and wasted area. A genetic algorithm is developed to solve this problem where a new coding scheme is introduced. To evaluate the performance of the proposed GA, first an upper b...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2017